On the m-Way Graph Partitioning Problem
نویسندگان
چکیده
منابع مشابه
Intelligent Structural Operators for the k-way Graph Partitioning Problem
ICGA 91 Intelligent Structural Operators for the k-way Graph Partitioning Problem 0 Intelligent Structural Operators for the k-way Graph Partitioning Problem Gregor von Laszewski Gesellschaft f ur Mathematik und Datenverarbeitung mbH Schlo Birlinghoven, D { 5205 St. Augustin [email protected] NorthEast Parallel Architectures Center Syracuse University 111 College Place Syracuse, NY 13244-4100
متن کاملSum-Max Graph Partitioning Problem
This paper tackles the following problem: given a connected graph G = (V,E) with a weight function on its edges and an integer k ≤ |V |, find a partition of V into k clusters such that the sum (over all pairs of clusters) of the heaviest edges between the clusters is minimized. We first prove that this problem (and even the unweighted variant) cannot be approximated within a factor of O(n1− ) u...
متن کاملPolynomial Observables in the Graph Partitioning Problem
Although NP-Complete problems are the most difficult decisional problems, it’s possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it’s possible to recognize in it two correlated polynomial observables. The particular behaviour of one of them with respect to the connectivity of the graph suggests the presence of a phase transition ...
متن کاملHybrid Metaheuristics for the Graph Partitioning Problem
The Graph Partitioning Problem (GPP) is one of the most studied NPcomplete problems notable for its broad spectrum of applicability such as in VLSI design, data mining, image segmentation, etc. Due to its high computational complexity, a large number of approximate approaches have been reported in the literature. Hybrid algorithms that are based on adaptations of popular metaheuristic technique...
متن کاملApplication of Fusion-Fission to the Multi-way Graph Partitioning Problem
This paper presents an application of the Fusion-Fission method to the multi-way graph partitioning problem. The Fusion-Fission method was first designed to solve the normalized cut partitioning problem. Its application to the multi-way graph partitioning problem is very recent, thus the Fusion-Fission algorithm has not yet been optimized. Then, the Fusion-Fission algorithm is slower than the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1995
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/38.3.237